Network Coding for Computing: Cut-Set Bounds
نویسندگان
چکیده
منابع مشابه
Network Coding Bounds 17.1 Network Coding 17.1.1 Upper Bound
Start with a directed acyclic graph (DAG) with a single sender and many receivers, where each receiver has k-edge connectivity from the sender. We assume that each edge has unit capacity, say, 1 bit/second. If our initial DAG does not meet this criterion, we can easily construct one that does: first, divide edge capacities by their greatest common divisor, then replace each c-capacity edge with...
متن کاملOn capacitated network design cut-set polyhedra
This paper provides an analysis of capacitated network design cut–set polyhedra. We give a complete linear description of the cut–set polyhedron of the single commodity – single facility capacitated network design problem. Then we extend the analysis to single commodity – multifacility and multicommodity – multifacility capacitated network design problems. Valid inequalities described here are ...
متن کاملComputing Lower Bounds for Steiner Trees in Road Network Design
In the automated design of road networks an important sub-task is the solution of an instance of the Steiner tree problem, a well known N P-hard problem. In this paper we present the experimental evaluation of a heuristic for the Steiner tree problem used in the design of low volume forest road networks. To evaluate a heuristic it is necessary to compare to the optimum value or a good lower bou...
متن کاملThe Cut and Dominating Set Problem in A Steganographer Network
A steganographer network corresponds to a graphic structure that the involved vertices (or called nodes) denote social entities such as the data encoders and data decoders, and the associated edges represent any real communicable channels or other social links that could be utilized for steganography. Unlike traditional steganographic algorithms, a steganographer network models steganographic c...
متن کاملStrong Converse for Discrete Memoryless Networks with Tight Cut-Set Bounds
This paper proves the strong converse for any discrete memoryless network (DMN) with tight cut-set bound, i.e., whose cut-set bound is achievable. Our result implies that for any DMN with tight cut-set bound and any fixed rate tuple that resides outside the capacity region, the average error probabilities of any sequence of length-n codes operated at the rate tuple must tend to 1 as n grows. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2011
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2010.2095070